Dominating set

Results: 145



#Item
81

PDF Document

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 05:11:28
82Logspace Versions of the Theorems of Bodlaender and Courcelle Michael Elberfeld Andreas Jakoby

Logspace Versions of the Theorems of Bodlaender and Courcelle Michael Elberfeld Andreas Jakoby

Add to Reading List

Source URL: wwwmayr.informatik.tu-muenchen.de

Language: English - Date: 2010-10-27 06:30:50
831 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti

1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti

Add to Reading List

Source URL: lii.rwth-aachen.de

Language: English - Date: 2014-02-04 08:14:43
84Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender ·

Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender ·

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2012-10-16 08:46:15
85How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2

How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2013-10-23 10:13:29
86Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in

Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:50
87Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´

Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´

Add to Reading List

Source URL: www.akt.tu-berlin.de

Language: English - Date: 2012-06-07 13:36:43
88Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1

Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2012-09-21 09:31:02
89ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c

ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2014-10-30 10:03:20
90Directed Scale-Free Graphs B´ela Bollob´as∗ Christian Borgs† Abstract

Directed Scale-Free Graphs B´ela Bollob´as∗ Christian Borgs† Abstract

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2002-10-04 16:22:45